﻿class Goldbach
{
    static bool IsPrime(int n)
    {
        if (n <= 1)
            return false;
        if (n <= 3)
            return true;

        if (n % 2 == 0 || n % 3 == 0)
            return false;

        for (int i = 5; i * i <= n; i += 6)
        {
            if (n % i == 0 || n % (i + 2) == 0)
                return false;
        }

        return true;
    }

    static void FindPrimeSum(int evenNumber)
    {
        for (int i = 2; i <= evenNumber / 2; i++)
        {
            if (IsPrime(i) && IsPrime(evenNumber - i))
            {
                Console.WriteLine($"{evenNumber} = {i} + {evenNumber - i}");
                break;
            }
        }
    }

    static void Main()
    {
        for (int i = 6; i <= 100; i += 2)
        {
            FindPrimeSum(i);
        }
    }
}
